A Fast Distortion Measurement Using Chord-Length Parameterisation within the Vertex- Based Operational Rate-Distortion Optimal Shape Coding Framework

نویسندگان

  • Ferdous A. Sohel
  • Gour C. Karmakar
  • Laurence S. Dooley
چکیده

Existing vertex-based operational rate-distortion (ORD) optimal shape coding algorithms use the shortest absolute distance (SAD) or alternatively either the distortion band (DB) or tolerance band (TB) as their distortion measuring technique. Each approach however can lead to inaccurate distortion measurements, though these can be avoided by employing the accurate distortion measurement technique for shape coding (ADMSC). From a computational time perspective, an N point contour requires ( ) 2 N O time for DB and TB for both polygon and B-spline based encoding, while SAD and ADMSC incur order ( ) N O time for polygonal encoding, but ( ) 2 N O complexity for B-spline based encoding, thereby rendering ORD optimal algorithms computationally inefficient. This paper presents a novel distortion measurement strategy based on chord-length parameterisation (DMCLP) of a boundary that incurs order ( ) N O complexity for both polygon and B-spline based encoding, while preserving an analogous rate-distortion performance to the original ORD optimal shape coding algorithms, when it is embedded within the ORD framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Distortion Measurement Using Chord-Length Parameterisation within the Vertex-Based Rate-Distortion Optimal Shape Coding Framework

Existing vertex-based operational rate-distortion (ORD) optimal shape coding algorithms can use a number of different distortion measurement techniques, including the shortest absolute distance (SAD), the distortion band (DB), the tolerance band (TB), and the accurate distortion measurement technique for shape coding (ADMSC). From a computational time perspective, an -point contour requires ( )...

متن کامل

B-spline-based shape coding with accurate distortion measurement using analytical model

In this paper, we present a new model to measure the contour point distortion for the vertex-based shape coding with B-splines, called accurate distortion measurement using analytical model (ADMAM). Different from existing distortion measurements containing approximation, quantization or parameterization process, our distortion is defined on the original B-spline. It is modeled as the shortest ...

متن کامل

A rate-distortion optimal scalable vertex based shape coding algorithm

In this paper, we present a rate-distortion (RD) optimized scalable vertex-based shape coding algorithm. Following the base layer, each successive enhancement layer re nes a given shape approximation by optimally (within a layer) placing new vertices and perturbing existing vertices. An e cient low entropy distortion adaptive vertex coding strategy is employed to take advantage of information a...

متن کامل

Operational rate-distortion optimal bit allocation between shape and texture for MPEG-4 video coding

MPEG-4 is the first multimedia standard that supports the decoupling of a video object into object shape and object texture information, which consequently brings up the optimal encoding problem for object-based video. In this paper, we present an operational rate-distortion optimal hit allocation scheme between shape and texture for MPEG-4 encoding. Our approach is based on the Lagrange multip...

متن کامل

Model-based human shape reconstruction from multiple views

Image-based modelling allows the reconstruction of highly realistic digital models from real-world objects. This paper presents a model-based approach to recover animated models of people from multiple-view video images. Two contributions are made, a multiple-resolution model-based framework is introduced that combines multiple visual cues in reconstruction. Secondly a novel mesh parameterisati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006